On a relation between k-path partition and k-path vertex cover
نویسندگان
چکیده
منابع مشابه
On a relation between k-path partition and k-path vertex cover
The vertex cover problem and the vertex partition problem are central problems in graph theory and many generalizations are known. Two examples are the minimum k-path vertex cover problem (MkPVCP for short, introduced in [1]), which asks for a minimum vertex sets covering every path of length k−1, and the minimum k-path partition problem (MkPPP for short, introduced in [2]), which asks for a mi...
متن کاملMinimum k-path vertex cover
A subset S of vertices of a graph G is called a k-path vertex cover if every path of order k in G contains at least one vertex from S. Denote by ψk(G) the minimum cardinality of a k-path vertex cover in G. It is shown that the problem of determining ψk(G) is NP-hard for each k ≥ 2, while for trees the problem can be solved in linear time. We investigate upper bounds on the value of ψk(G) and pr...
متن کاملOn the k-path vertex cover of some graph products
A subset S of vertices of a graph G is called a k-path vertex cover if every path of order k in G contains at least one vertex from S. Denote by ψk(G) the minimum cardinality of a k-path vertex cover in G. In this paper improved lower and upper bounds for ψk of the Cartesian and the direct product of paths are derived. It is shown that for ψ3 those bounds are tight. For the lexicographic produc...
متن کاملThe k-path vertex cover of rooted product graphs
A subset S of vertices of a graph G is called a k-path vertex cover if every path of order k in G contains at least one vertex from S. Denote by ψk(G) the minimum cardinality of a k-path vertex cover in G. In this article a lower and an upper bound for ψk of the rooted product graphs are presented. Two characterizations are given when those bounds are attained. Moreover ψ2 and ψ3 are exactly de...
متن کاملThe k-path vertex cover of some product graphs
For a graph G and a positive integer k, a subset S of vertices of G is called a k-path vertex cover if every path of order k inG contains at least one vertex from S. The cardinality of a minimum k-path vertex cover is denoted by ψk(G). In this paper, we give some bounds and the exact values in special cases for ψk of the Cartesian, and lexicographic products of some graphs. Key–Words: Vertex co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2017
ISSN: 0166-218X
DOI: 10.1016/j.dam.2017.01.013